Note on the Subgraph Component Polynomial
نویسندگان
چکیده
منابع مشابه
Note on the Subgraph Component Polynomial
Tittmann, Averbouch and Makowsky [The enumeration of vertex induced subgraphs with respect to the number of components, European J. Combin. 32 (2011) 954–974] introduced the subgraph component polynomial Q(G;x, y) of a graph G, which counts the number of connected components in vertex induced subgraphs. This polynomial encodes a large amount of combinatorial information about the underlying gra...
متن کاملBorder Correlations, Lattices, and the Subgraph Component Polynomial
We consider the border sets of partial words and study the combinatorics of specific representations of them, called border correlations, which are binary vectors of same length indicating the borders. We characterize precisely which of these vectors are valid border correlations, and establish a one-to-one correspondence between the set of valid border correlations and the set of valid period ...
متن کاملNote on Omega Polynomial
Omega polynomial, counting opposite edge strips ops, was proposed by Diudea to describe cycle-containing molecular structures, particularly those associated with nanostructures. In this paper, some theoretical aspects are evidenced and particular cases are illustrated.
متن کاملNote on Polynomial Recurrence
Let (X,B, μ, T ) be a measure-preserving system. The well-known Poincare recurrence theorem asserts for any A ∈ B with μ(A) > 0, there exist infinitely many n ∈ N such that μ(A ∩ TA) > 0. For a subset S of N, we say S is syndetic if there exists a constant C > 0 such that S ∩ [x, x + C] 6= ∅ for any sufficiently large x, i.e., S has bound gaps. In [5], Khintchine proved that for any A ∈ B with ...
متن کاملSubgraph Isomorphism in Polynomial Time
In this paper, we propose a new approach to the problem of subgraph isomorphism detection. The new method is designed for systems which di erentiate between graphs that are a priori known, so-called model graphs, and unknown graphs, so-called input graphs. The problem to be solved is to nd a subgraph isomorphism from an input graph, which is given on-line, to any of the model graphs. The new me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/3953